The Sensitivity of Least Squares Polynomial Approximation

نویسنده

  • Bernhard Beckermann
چکیده

Given integers N n 0, we consider the least squares problem of nding the vector of coeecients ~ P with respect to a polynomial basis P N j=0 wn(zj) 2 jf(zj) ? P (zj)j 2. Here a perturbation of the values f(zj) leads to some perturbation of the coeecient vector ~ P. We denote by n the maximal magniication of relative errors, i.e., the Euclidean condition number of the underlying weighted Vandermonde{like matrix. For the basis of monomials (pj(z) = z j), the quantity n equals one when the abscissas are the roots of unity; however, it is known that n increases exponentially in the case of real abscissas. Here we investigate the nth{root behavior of n for some xed basis and a xed distribution of (complex) abscissas. An estimate for the nth{root limit of n is given in terms of the solution to a weighted constrained energy problem in complex potential theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical solution of the spread of infectious diseases mathematical model based on shifted Bernstein polynomials

The Volterra delay integral equations have numerous applications in various branches of science, including biology, ecology, physics and modeling of engineering and natural sciences. In many cases, it is difficult to obtain analytical solutions of these equations. So, numerical methods as an efficient approximation method for solving Volterra delay integral equations are of interest to many res...

متن کامل

A Comparative Study of Least-Squares and the Weak-Form Galerkin Finite Element Models for the Nonlinear Analysis of Timoshenko Beams

In this paper, a comparison of weak-form Galerkin and least-squares finite element models of Timoshenko beam theory with the von Kármán strains is presented. Computational characteristics of the two models and the influence of the polynomial orders used on the relative accuracies of the two models are discussed. The degree of approximation functions used varied from linear to the 5th order. In ...

متن کامل

Sensitivity analysis for Szegő polynomials

Szegő polynomials are orthogonal with respect to an inner product on the unit circle. Numerical methods for weighted least-squares approximation by trigonometric polynomials conveniently can be derived and expressed with the aid of Szegő polynomials. This paper discusses the conditioning of several mappings involving Szegő polynomials and, thereby, sheds light on the sensitivity of some approxi...

متن کامل

A meshless discrete Galerkin method for solving the universe evolution differential equations based on the moving least squares approximation

In terms of observational data, there are some problems in the standard Big Bang cosmological model. Inflation era, early accelerated phase of the evolution of the universe, can successfully solve these problems. The inflation epoch can be explained by scalar inflaton field. The evolution of this field is presented by a non-linear differential equation. This equation is considered in FLRW model...

متن کامل

MOX–Report No. 47/2013 Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs

Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate functions based on random sampling according to a given probability measure. Recent work has shown that in the univariate case and for the uniform distribution, the least-squares method is optimal in expectation in [1] and in probability in [7]...

متن کامل

Discrete least squares polynomial approximation with random evaluations – application to parametric and stochastic elliptic PDES

Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate functions based on random sampling according to a given probability measure. Recent work has shown that in the univariate case, the least-squares method is quasi-optimal in expectation in [8] and in probability in [20], under suitable condition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998